منابع مشابه
Shortest paths between shortest paths
We study the following problem on recon guring shortest paths in graphs: Given two shortest st paths, what is the minimum number of steps required to transform one into the other, where each intermediate path must also be a shortest s-t path and must di er from the previous one by only one vertex. We prove that the shortest recon guration sequence can be exponential in the size of the graph and...
متن کاملShortest Descending Paths through Given Faces
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to find a shortest descending path from s to t in a polyhedral terrain. We give some properties of such paths. In the case where the face sequence is specified, we show that the shortest descending path is unique, and giv...
متن کاملShortest paths through two-tone pairs
A color change occurs in a solution to Problem 1 whenever adjacent letters of w differ in color. The number of occurences of each element of Σ in w is not prescribed in the general form of the problem, where it can be seen as the problem of sequencing products (the elements of Σ) so that the production sequence is maintained and contains a minimal number of color changes (an application can be ...
متن کاملShortest Paths between Shortest Paths and Independent Sets
We study problems of reconfiguration of shortest paths in graphs. We prove that the shortest reconfiguration sequence can be exponential in the size of the graph and that it is NP-hard to compute the shortest reconfiguration sequence even when we know that the sequence has polynomial length. Moreover, we also study reconfiguration of independent sets in three different models and analyze relati...
متن کاملShortest paths on a polyhedron, Part I: Computing shortest paths
We present an algorithm for determining the shortest path between any two points along the surface of a polyhedron which need not be convex. This algorithm also computes for any source point on the surface of a polyhedron the inward layout and the subdivision of the polyhedron which can be used for processing queries of shortest paths between the source point and any destination point. Our algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2019
ISSN: 2470-0045,2470-0053
DOI: 10.1103/physreve.99.012422